1,410 research outputs found
Pole Dancing: 3D Morphs for Tree Drawings
We study the question whether a crossing-free 3D morph between two
straight-line drawings of an -vertex tree can be constructed consisting of a
small number of linear morphing steps. We look both at the case in which the
two given drawings are two-dimensional and at the one in which they are
three-dimensional. In the former setting we prove that a crossing-free 3D morph
always exists with steps, while for the latter steps
are always sufficient and sometimes necessary.Comment: Appears in the Proceedings of the 26th International Symposium on
Graph Drawing and Network Visualization (GD 2018
Algorithmic approach to adiabatic quantum optimization
It is believed that the presence of anticrossings with exponentially small
gaps between the lowest two energy levels of the system Hamiltonian, can render
adiabatic quantum optimization inefficient. Here, we present a simple adiabatic
quantum algorithm designed to eliminate exponentially small gaps caused by
anticrossings between eigenstates that correspond with the local and global
minima of the problem Hamiltonian. In each iteration of the algorithm,
information is gathered about the local minima that are reached after passing
the anticrossing non-adiabatically. This information is then used to penalize
pathways to the corresponding local minima, by adjusting the initial
Hamiltonian. This is repeated for multiple clusters of local minima as needed.
We generate 64-qubit random instances of the maximum independent set problem,
skewed to be extremely hard, with between 10^5 and 10^6 highly-degenerate local
minima. Using quantum Monte Carlo simulations, it is found that the algorithm
can trivially solve all the instances in ~10 iterations.Comment: 7 pages, 3 figure
Multigrid solver for axisymmetrical 2D fluid equations
We have developed an efficient algorithm for steady axisymmetrical 2D fluid
equations. The algorithm employs multigrid method as well as standard implicit
discretization schemes for systems of partial differential equations. Linearity
of the multigrid method with respect to the number of grid points allowed us to
use grid, where we could achieve solutions in several minutes.
Time limitations due to nonlinearity of the system are partially avoided by
using multi level grids(the initial solution on grid was
extrapolated steady solution from grid which allowed using
"long" integration time steps). The fluid solver may be used as the basis for
hybrid codes for DC discharges.Comment: preliminary version; presented at 28 ICPIG, July 15-20, 2007, Prague,
Czech Republi
Grid-Obstacle Representations with Connections to Staircase Guarding
In this paper, we study grid-obstacle representations of graphs where we
assign grid-points to vertices and define obstacles such that an edge exists if
and only if an -monotone grid path connects the two endpoints without
hitting an obstacle or another vertex. It was previously argued that all planar
graphs have a grid-obstacle representation in 2D, and all graphs have a
grid-obstacle representation in 3D. In this paper, we show that such
constructions are possible with significantly smaller grid-size than previously
achieved. Then we study the variant where vertices are not blocking, and show
that then grid-obstacle representations exist for bipartite graphs. The latter
has applications in so-called staircase guarding of orthogonal polygons; using
our grid-obstacle representations, we show that staircase guarding is
\textsc{NP}-hard in 2D.Comment: To appear in the proceedings of the 25th International Symposium on
Graph Drawing and Network Visualization (GD 2017
Approximate solution of NP optimization problems
AbstractThis paper presents the main results obtained in the field of approximation algorithms in a unified framework. Most of these results have been revisited in order to emphasize two basic tools useful for characterizing approximation classes, that is, combinatorial properties of problems and approximation preserving reducibilities. In particular, after reviewing the most important combinatorial characterizations of the classes PTAS and FPTAS, we concentrate on the class APX and, as a concluding result, we show that this class coincides with the class of optimization problems which are reducible to the maximum satisfiability problem with respect to a polynomial-time approximation preserving reducibility
Enumeration of s-d separators in DAGs with application to reliability analysis in temporal graphs
Temporal graphs are graphs in which arcs have temporal labels, specifying at which time they can be traversed. Motivated by recent results concerning the reliability analysis of a temporal graph through the enumeration of minimal cutsets in the corresponding line graph, in this paper we attack the problem of enumerating minimal s-d separators in s-d directed acyclic graphs (in short, s-d DAGs), also known as 2-terminal DAGs or s-t digraphs. Our main result is an algorithm for enumerating all the minimal s-d separators in a DAG with O(nm) delay, where n and m are respectively the number of nodes and arcs, and the delay is the time between the output of two consecutive solutions. To this aim, we give a characterization of the minimal s-d separators in a DAG through vertex cuts of an expanded version of the DAG itself. As a consequence of our main result, we provide an algorithm for enumerating all the minimal s-d cutsets in a temporal graph with delay O(m3), where m is the number of temporal arcs
Integrating algorithm visualization video into a first-year algorithm and data structure course
In this paper we describe the results that we have obtained while integrating algorithm visualization (AV) movies (strongly tightened with the other teaching material), within a first-year undergraduate course on algorithms and data structures. Our experimental results seem to support the hypothesis that making these movies available significantly improved students' performances. Moreover, the movies were highly appreciated by the students (both from a comprehensibility point of view and from a usefulness point of view), even though with a low attitude towards the emerging video pod-cast technology. Finally, our results indicate the necessity of integrating the AV movies with audio comment, which seems to be one of the most interesting research question left open by our study. © International Forum of Educational Technology & Society (IFETS)
- …